GATE CSE 1997


Q31.

The correct matching for the following pairs is:\begin{array}{ll} \text{(A) DMA I/O} & \text{(1) High speed RAM} \\ \text{(B) Cache} & \text{(2) Disk} \\ \text{(C) Interrupt I/O} & \text{(3) Printer} \\ \text{(D) Condition Code Register} & \text{(4) ALU} \\ \end{array}
GateOverflow

Q32.

RST 7.5 interrupt in 8085 microprocessor executes the interrupt service routing from interrupt vector location
GateOverflow

Q33.

The concatenation of two lists is to be performed on O(1) time. Which of the following implementations of a list should be used?
GateOverflow

Q34.

In the lattice defined by the Hasse diagram given in following figure, how many complements does the element 'e' have?
GateOverflow

Q35.

The correct matching for the following pairs is \begin{array}{ll|ll}\hline \text{A.} & \text{All pairs shortest path} & \text{1.} & \text{Greedy} \\\hline \text{B.} & \text{Quick Sort} & \text{2.}& \text{Depth-First Search} \\\hline \text{C.}& \text{Minimum weight spanning tree} & \text{3.} & \text{Dynamic Programming} \\\hline \text{D.} & \text{Connected Components} &\text{4.} & \text{Divide and Conquer} \\\hline \end{array}
GateOverflow

Q36.

For a database relation R(a, b, c, d), where the domains a, b, c, d include only atomic values, only the following functional dependencies and those that can be inferred from them hold a \rightarrow c b \rightarrow d This relation is
GateOverflow

Q37.

Purpose of a start bit in \text{RS-232} serial communication protocol is:
GateOverflow

Q38.

The trapezoidal method to numerically obtain \int_a^b f(x) dx has an error E bounded by \frac{b-a}{12} h^2 \max f''(x), x \in [a, b] where h is the width of the trapezoids. The minimum number of trapezoids guaranteed to ensure E \leq 10^{-4} in computing \ln 7 using f=\frac{1}{x} is
GateOverflow

Q39.

Using the forward Euler method to solve y''(t) = f(t), y'(0)=0 with a step size of h, we obtain the following values of y in the first four iterations:
GateOverflow

Q40.

The Newton-Raphson method is used to find the root of the equation X^2-2=0. If the iterations are started from -1, the iterations will
GateOverflow